Algebraic graph theory

Results: 826



#Item
51Asian Journal of Control, Vol. 16, No. 1, pp. 30–39, January 2014 Published online 25 September 2012 in Wiley Online Library (wileyonlinelibrary.com) DOI: asjc.610 CONSENSUS FOR AGENTS WITH DOUBLE INTEGRATOR DY

Asian Journal of Control, Vol. 16, No. 1, pp. 30–39, January 2014 Published online 25 September 2012 in Wiley Online Library (wileyonlinelibrary.com) DOI: asjc.610 CONSENSUS FOR AGENTS WITH DOUBLE INTEGRATOR DY

Add to Reading List

Source URL: www.control.tu-berlin.de

Language: English - Date: 2015-03-27 05:46:10
52Wins and Losses of Algebraic Transformations of Software Architectures H.M. Fahmy1 , R.C. Holt 1 , and J.R. Cordy2 Dep’t. of Computer Science, University of Waterloo, Waterloo, Ontario 2 Dep’t. of Computing & Informa

Wins and Losses of Algebraic Transformations of Software Architectures H.M. Fahmy1 , R.C. Holt 1 , and J.R. Cordy2 Dep’t. of Computer Science, University of Waterloo, Waterloo, Ontario 2 Dep’t. of Computing & Informa

Add to Reading List

Source URL: plg.uwaterloo.ca

Language: English - Date: 2001-07-02 11:19:54
53121  Doc. Math. J. DMV On the Construction of the Kan Loop Group Friedhelm Waldhausen

121 Doc. Math. J. DMV On the Construction of the Kan Loop Group Friedhelm Waldhausen

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-07-13 07:29:13
54Spectral Graph Theory and Applications  WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun

Spectral Graph Theory and Applications WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2011-12-08 09:45:37
55An Elementary Construction of Constant-Degree Expanders∗ Noga Alon †  Oded Schwartz

An Elementary Construction of Constant-Degree Expanders∗ Noga Alon † Oded Schwartz

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:32:24
56Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em

Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2014-04-12 04:53:59
57Spectral Graph Theory  Lecture 11 PSRGs via Random Walks on Graphs Daniel A. Spielman

Spectral Graph Theory Lecture 11 PSRGs via Random Walks on Graphs Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-08-17 14:43:26
58High-Productivity and HighPerformance Analysis of Filtered Semantic Graphs Aydın	
  Buluç	
  	
   Lawrence Berkeley National Laboratory February 20, 2014

High-Productivity and HighPerformance Analysis of Filtered Semantic Graphs Aydın  Buluç     Lawrence Berkeley National Laboratory February 20, 2014

Add to Reading List

Source URL: gauss.cs.ucsb.edu

Language: English - Date: 2014-02-20 18:35:16
59Spectral Graph Theory and its Applications  September 21, 2004 Lecture 6 Lecturer: Daniel A. Spielman

Spectral Graph Theory and its Applications September 21, 2004 Lecture 6 Lecturer: Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2005-06-30 12:02:45
6021  Documenta Math. The Euler Characteristic of a Category Tom Leinster1

21 Documenta Math. The Euler Characteristic of a Category Tom Leinster1

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2008-04-01 12:28:25